Sen Software Engineering Coinductive Counting: Bisimulation in Enumerative Combinatorics Extended Abstract

Coinductive counting: bisimulation in enumerative combinatorics (extended abstract) CWI's research has a theme-oriented structure and is grouped into four clusters. Listed below are the names of the clusters and in parentheses their acronyms. ABSTRACT The recently developed coinductive calculus of streams nds here a further application in enumer-ative c o m binatorics. A general methodology is developed to solve a wide variety of basic counting problems in a uniform way: 1 the objects to be counted are enumerated by means of an innnite weighted automaton; 2 the automaton is minimized by means of the quantitative notion of stream bisimulation; 3 the minimized automaton is used to compute an expression in terms of stream constants and operators that represents the stream of all counts.